Sciweavers

120 search results - page 24 / 24
» New completeness results for lazy conditional narrowing
Sort
View
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
13 years 11 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
VLDB
1998
ACM
147views Database» more  VLDB 1998»
13 years 10 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
VW
2000
Springer
215views Virtual Reality» more  VW 2000»
13 years 9 months ago
A 3-D Biomechanical Model of the Salamander
This article describes a 3D biomechanical simulation of a salamander to be used in experiments in computational neuroethology. The physically-based simulation represents the salama...
Auke Jan Ijspeert
DAM
2007
177views more  DAM 2007»
13 years 6 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
WG
2010
Springer
13 years 4 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski