Sciweavers

2526 search results - page 78 / 506
» A New Algorithm for Answer Set Computation
Sort
View
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
16 years 2 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
FCT
2005
Springer
15 years 7 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
FOCM
2008
59views more  FOCM 2008»
15 years 2 months ago
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
For an ideal I R[x] given by a set of generators, a new semidefinite characterization of its real radical I(VR(I)) is presented, provided it is zero-dimensional (even if I is not...
Jean B. Lasserre, Monique Laurent, Philipp Rostals...
CGF
2008
174views more  CGF 2008»
15 years 2 months ago
Particle Level Set Advection for the Interactive Visualization of Unsteady 3D Flow
Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from ...
Nicolas Cuntz, Andreas Kolb, Robert Strzodka, Dani...
121
Voted
FSTTCS
2009
Springer
15 years 9 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...