Sciweavers

486 search results - page 84 / 98
» Improved upper bounds for 3-SAT
Sort
View
ESORICS
2006
Springer
14 years 3 days ago
Towards an Information-Theoretic Framework for Analyzing Intrusion Detection Systems
IDS research still needs to strengthen mathematical foundations and theoretic guidelines. In this paper, we build a formal framework, based on information theory, for analyzing and...
Guofei Gu, Prahlad Fogla, David Dagon, Wenke Lee, ...
GRAPHICSINTERFACE
2007
13 years 10 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
NIPS
2007
13 years 10 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 9 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 8 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha