Sciweavers

11214 search results - page 97 / 2243
» Just-in-time data structures
Sort
View
PPOPP
2012
ACM
12 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
ICML
2009
IEEE
14 years 11 months ago
Structure learning with independent non-identically distributed data
There are well known algorithms for learning the structure of directed and undirected graphical models from data, but nearly all assume that the data consists of a single i.i.d. s...
Robert E. Tillman
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 11 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
ICCV
2007
IEEE
14 years 4 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
SDMW
2004
Springer
14 years 3 months ago
Secure and Privacy Preserving Outsourcing of Tree Structured Data
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
Ping Lin, K. Selçuk Candan