Sciweavers

433 search results - page 55 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
INFOCOM
2008
IEEE
15 years 6 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
ICASSP
2007
IEEE
15 years 6 months ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung
ICDM
2007
IEEE
192views Data Mining» more  ICDM 2007»
15 years 6 months ago
Discovering Temporal Communities from Social Network Documents
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...
IROS
2007
IEEE
122views Robotics» more  IROS 2007»
15 years 6 months ago
Towards a novel safety norm for domestic robotics
— Safety is a critical success factor for consumer acceptance of domestic robotic products. Some researchers have adopted the Head Injury Criterion (HIC) as absolute safety norm....
Martin Wassink, Stefano Stramigioli
CSR
2007
Springer
15 years 6 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen