Sciweavers

10988 search results - page 1681 / 2198
» Algorithmic Folding Complexity
Sort
View
223
Voted
PLDI
2012
ACM
13 years 9 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
INFOCOM
2012
IEEE
13 years 9 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
PAMI
2012
13 years 9 months ago
Recursive Segmentation and Recognition Templates for Image Parsing
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
Long Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan...
PODS
2009
ACM
124views Database» more  PODS 2009»
16 years 8 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 8 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
« Prev « First page 1681 / 2198 Last » Next »