Sciweavers

2904 search results - page 146 / 581
» Number Forms in the Brain
Sort
View
COMCOM
2008
99views more  COMCOM 2008»
15 years 7 months ago
Efficiently reconfigurable backbones for wireless sensor networks
We present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building ...
Stefano Basagni, Chiara Petrioli, Roberto Petrocci...
CVPR
2008
IEEE
16 years 9 months ago
A Parallel Decomposition Solver for SVM: Distributed dual ascend using Fenchel Duality
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
Tamir Hazan, Amit Man, Amnon Shashua
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 8 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
ICML
2009
IEEE
16 years 8 months ago
Learning dictionaries of stable autoregressive models for audio scene analysis
In this paper, we explore an application of basis pursuit to audio scene analysis. The goal of our work is to detect when certain sounds are present in a mixed audio signal. We fo...
Youngmin Cho, Lawrence K. Saul
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 7 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking