Sciweavers

821 search results - page 112 / 165
» Energy Efficient Algorithms for the RFID Estimation Problem
Sort
View
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
16 years 5 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
CP
2009
Springer
16 years 4 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
EC
2006
195views ECommerce» more  EC 2006»
15 years 4 months ago
Automated Global Structure Extraction for Effective Local Building Block Processing in XCS
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
Martin V. Butz, Martin Pelikan, Xavier Llorà...
ICML
2009
IEEE
16 years 4 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
ICCV
2007
IEEE
16 years 6 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov