Sciweavers

7006 search results - page 1190 / 1402
» Approximation Algorithms
Sort
View
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 6 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
COMPGEOM
2009
ACM
16 years 24 days ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
INFOCOM
2007
IEEE
16 years 18 days ago
Load Balancing in Large-Scale RFID Systems
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
Qunfeng Dong, Ashutosh Shukla, Vivek Shrivastava, ...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
BMCBI
2006
112views more  BMCBI 2006»
15 years 6 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...
« Prev « First page 1190 / 1402 Last » Next »