Sciweavers

139 search results - page 16 / 28
» Reducibilities Relating to Schnorr Randomness
Sort
View
ANOR
2007
80views more  ANOR 2007»
13 years 11 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
JAR
2000
129views more  JAR 2000»
13 years 10 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...
VTC
2010
IEEE
195views Communications» more  VTC 2010»
13 years 8 months ago
Efficiency of Distributed Compression and Its Dependence on Sensor Node Deployments
Abstract--In this paper we analyze the energy-efficiency of distributed compression and its dependence on the node deployment strategies for Wireless Sensor Networks (WSNs). Reduce...
Frank Oldewurtel, Janne Riihijärvi, Petri M&a...
DEBU
2010
128views more  DEBU 2010»
13 years 8 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 11 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...