Sciweavers

1007 search results - page 137 / 202
» The Complexity of Futile Questioning
Sort
View
105
Voted
STACS
2007
Springer
15 years 6 months ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
99
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Bounds on the Lifetime of Wireless Sensor Networks Employing Multiple Data Sinks
Abstract—Employing multiple base stations is an attractive approach to enhance the lifetime of wireless sensor networks. In this paper, we address the fundamental question concer...
Amar P. Azad, Ananthanarayanan Chockalingam
IEEEPACT
2006
IEEE
15 years 6 months ago
Core architecture optimization for heterogeneous chip multiprocessors
Previous studies have demonstrated the advantages of single-ISA heterogeneous multi-core architectures for power and performance. However, none of those studies examined how to de...
Rakesh Kumar, Dean M. Tullsen, Norman P. Jouppi
106
Voted
ADBIS
2006
Springer
103views Database» more  ADBIS 2006»
15 years 6 months ago
Bridging the Gap between Comparison and Conforming the Views in View Integration
View integration is a complex, error-prone and time-consuming task. Therefore there is a need to decompose the integration methods into smaller well defined phases where different ...
Peter Bellström
GIR
2006
ACM
15 years 6 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai