Sciweavers

157 search results - page 15 / 32
» Size space tradeoffs for resolution
Sort
View
ICS
2009
Tsinghua U.
13 years 5 months ago
Refereeing conflicts in hardware transactional memory
In the search for high performance, most transactional memory (TM) systems execute atomic blocks concurrently and must thus be prepared for data conflicts. The TM system must then...
Arrvindh Shriraman, Sandhya Dwarkadas
AAAI
2006
13 years 9 months ago
Approximate Compilation for Embedded Model-based Reasoning
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded features to perform self-diagnosis or self-reconfiguration. These features ...
Barry O'Sullivan, Gregory M. Provan
INFOCOM
2008
IEEE
14 years 2 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
EDBT
2002
ACM
139views Database» more  EDBT 2002»
14 years 7 months ago
Aggregate Processing of Planar Points
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
Yufei Tao, Dimitris Papadias, Jun Zhang
PVLDB
2010
149views more  PVLDB 2010»
13 years 6 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...