Sciweavers

2370 search results - page 257 / 474
» A Structured Set of Higher-Order Problems
Sort
View
BCS
2008
15 years 5 months ago
Overcoming Software Fragility with Interacting Feedback Loops and Reversible Phase Transitions
Programs are fragile for many reasons, including software errors, partial failures, and network problems. One way to make software more robust is to design it from the start as a ...
Peter Van Roy
CADE
2005
Springer
16 years 4 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 4 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
CVPR
2006
IEEE
15 years 10 months ago
Fast Variational Segmentation using Partial Extremal Initialization
In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two...
Jan Erik Solem, Niels Chr. Overgaard, Markus Perss...
FOCS
2006
IEEE
15 years 10 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee