Sciweavers

685 search results - page 87 / 137
» Succinct Trees in Practice
Sort
View
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 6 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
TOMS
2010
106views more  TOMS 2010»
13 years 6 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
COLING
2010
13 years 2 months ago
2D Trie for Fast Parsing
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...
Xian Qian, Qi Zhang, Xuanjing Huang, Lide Wu
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...
ICSE
2009
IEEE-ACM
14 years 8 months ago
FEATUREHOUSE: Language-independent, automated software composition
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
Christian Kästner, Christian Lengauer, Sven A...