Sciweavers

1389 search results - page 166 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICNP
2007
IEEE
15 years 9 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...
JCO
2010
101views more  JCO 2010»
15 years 1 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
NIPS
2008
15 years 4 months ago
Bayesian Experimental Design of Magnetic Resonance Imaging Sequences
We show how improved sequences for magnetic resonance imaging can be found through optimization of Bayesian design scores. Combining approximate Bayesian inference and natural ima...
Matthias W. Seeger, Hannes Nickisch, Rolf Pohmann,...
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
15 years 7 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
AIRS
2004
Springer
15 years 8 months ago
Document Clustering Using Linear Partitioning Hyperplanes and Reallocation
This paper presents a novel algorithm for document clustering based on a combinatorial framework of the Principal Direction Divisive Partitioning (PDDP) algorithm [1] and a simpli...
Canasai Kruengkrai, Virach Sornlertlamvanich, Hito...