Sciweavers

6506 search results - page 1164 / 1302
» Algorithmic models for sensor networks
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 10 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
IJFCS
1998
67views more  IJFCS 1998»
14 years 9 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
PVLDB
2010
152views more  PVLDB 2010»
14 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
AR
2011
14 years 5 months ago
Real-Time Pose-Invariant Face Recognition Using the Efficient Second-Order Minimization and the Pose Transforming Matrix
We propose a real-time pose invariant face recognition algorithm from a gallery of frontal images only. First, we modified the second order minimization method for active appearan...
Hyun-Chul Choi, Se-Young Oh
JNCA
2011
102views more  JNCA 2011»
14 years 27 days ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...
« Prev « First page 1164 / 1302 Last » Next »