Sciweavers

1816 search results - page 345 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
81
Voted
ECCV
2004
Springer
15 years 11 months ago
On the Significance of Real-World Conditions for Material Classification
Classifying materials from their appearance is a challenging problem, especially if illumination and pose conditions are permitted to change: highlights and shadows caused by 3D st...
Eric Hayman, Barbara Caputo, Mario Fritz, Jan-Olof...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 2 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
CCS
2007
ACM
15 years 1 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
SIGGRAPH
1997
ACM
15 years 1 months ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...