Sciweavers

45 search results - page 1 / 9
» Finding Witnesses by Peeling
Sort
View
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
13 years 11 months ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
MICCAI
2010
Springer
13 years 3 months ago
Micro-force Sensing in Robot Assisted Membrane Peeling for Vitreoretinal Surgery
Abstract. Vitreoretinal surgeons use 0.5mm diameter instruments to manipulate delicate tissue inside the eye while applying imperceptible forces that can cause damage to the retina...
Marcin Balicki, Ali Uneri, Iulian Iordachita, Jame...
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
13 years 11 months ago
Low-Depth Witnesses are Easy to Find
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
Luis Antunes 0002, Lance Fortnow, Alexandre Pinto,...
CINQ
2004
Springer
119views Database» more  CINQ 2004»
13 years 10 months ago
How to Quickly Find a Witness
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...
ANTS
1994
Springer
80views Algorithms» more  ANTS 1994»
13 years 9 months ago
On the difficulty of finding reliable witnesses
W. R. Alford, Andrew Granville, Carl Pomerance