Sciweavers

868 search results - page 138 / 174
» Finding Most Likely Solutions
Sort
View
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 2 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
INFOCOM
2006
IEEE
14 years 1 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
PCM
2004
Springer
224views Multimedia» more  PCM 2004»
14 years 1 months ago
Fast and Robust Short Video Clip Search for Copy Detection
Query by video clip (QVC) has attracted wide research interests in multimedia information retrieval. In general, QVC may include feature extraction, similaritymeasure,databaseorgan...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Surendra Rang...
WWW
2008
ACM
14 years 8 months ago
A combinatorial allocation mechanism with penalties for banner advertising
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, ...
ICFP
2008
ACM
14 years 7 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman