Sciweavers

1450 search results - page 238 / 290
» On the Complexity of Hardness Amplification
Sort
View
COMPGEOM
2006
ACM
14 years 4 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
DOCENG
2006
ACM
14 years 4 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
HRI
2006
ACM
14 years 4 months ago
Teaching robots by moulding behavior and scaffolding the environment
Programming robots to carry out useful tasks is both a complex and non-trivial exercise. A simple and intuitive method to allow humans to train and shape robot behaviour is clearl...
Joe Saunders, Chrystopher L. Nehaniv, Kerstin Daut...
ISPD
2006
ACM
90views Hardware» more  ISPD 2006»
14 years 4 months ago
Fast buffer insertion considering process variations
Advanced process technologies call for a proactive consideration of process variations in design to ensure high parametric timing yield. Despite of its popular use in almost any h...
Jinjun Xiong, Lei He
ISSTA
2006
ACM
14 years 4 months ago
Test input generation for java containers using state matching
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
Willem Visser, Corina S. Pasareanu, Radek Pel&aacu...