Sciweavers

778 search results - page 34 / 156
» Bounding Smooth Integers
Sort
View
ALT
1998
Springer
13 years 12 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ECCC
2010
98views more  ECCC 2010»
13 years 7 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
CP
2005
Springer
14 years 1 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
WADS
2001
Springer
124views Algorithms» more  WADS 2001»
14 years 1 days ago
Deciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
Wolfgang Espelage, Frank Gurski, Egon Wanke
VIS
2008
IEEE
192views Visualization» more  VIS 2008»
14 years 9 months ago
Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs
Abstract--Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate o...
Paul Rosenthal, Lars Linsen