Sciweavers

1066 search results - page 140 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
CN
2006
75views more  CN 2006»
14 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
FOCS
2008
IEEE
14 years 10 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
WWW
2011
ACM
14 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
SIGGRAPH
1999
ACM
15 years 2 months ago
A Morphable Model for the Synthesis of 3D Faces
In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly throu...
Volker Blanz, Thomas Vetter
CCR
2010
151views more  CCR 2010»
14 years 7 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...