Sciweavers

11214 search results - page 1957 / 2243
» Just-in-time data structures
Sort
View
VLDB
2005
ACM
113views Database» more  VLDB 2005»
16 years 6 days ago
Optimistic Intra-Transaction Parallelism on Chip Multiprocessors
With the advent of chip multiprocessors, exploiting intra-transaction parallelism is an attractive way of improving transaction performance. However, exploiting intra-transaction ...
Christopher B. Colohan, Anastassia Ailamaki, J. Gr...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
16 years 6 days ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 6 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
ACMICEC
2004
ACM
205views ECommerce» more  ACMICEC 2004»
16 years 5 days ago
M-Modeler: a framework implementation for modeling m-commerce applications
At the present time, the use of mobile technology in business, is becoming an opportunity to generate competitive advantages within organization environments. Mobile technology he...
Ana Hilda Morales-Aranda, Oscar Mayora-Ibarra, San...
COMPGEOM
2004
ACM
16 years 5 days ago
The corner arc algorithm
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
Olaf A. Hall-Holt
« Prev « First page 1957 / 2243 Last » Next »