335 search results - page 41 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
131
Voted
ISSTA
2010
ACM
15 years 7 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
116
Voted
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
137
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
136
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
113
Voted
ISPD
1999
ACM
15 years 7 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...