Sciweavers

3146 search results - page 20 / 630
» Efficient Consequence Finding
Sort
View
ICIP
2007
IEEE
13 years 11 months ago
Finding Optimal Integral Sampling Lattices for a given Frequency Support in Multidimensions
The search for alias-free sampling lattices for a given frequency support, in particular those lattices achieving minimum sampling densities, is a fundamental issue in various app...
Yue M. Lu, Minh N. Do
GLOBECOM
2010
IEEE
13 years 5 months ago
Finding and Mending Barrier Gaps in Wireless Sensor Networks
Constructing sensing barriers using wireless sensor networks has important applications in military operations and homeland security. The goal of forming a sensing barrier is to de...
Anwar Saipulla, Benyuan Liu, Jie Wang
IMCSIT
2010
13 years 5 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen
JC
2000
78views more  JC 2000»
13 years 7 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 8 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl