Sciweavers

7015 search results - page 1307 / 1403
» Approximation algorithms for co-clustering
Sort
View
STACS
2007
Springer
14 years 3 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
MM
2006
ACM
108views Multimedia» more  MM 2006»
14 years 3 months ago
Video search reranking via information bottleneck principle
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang
PLDI
2006
ACM
14 years 3 months ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
IUI
2005
ACM
14 years 2 months ago
Intelligent data entry assistant for XML using ensemble learning
XML has emerged as the primary standard of data representation and data exchange [13]. Although many software tools exist to assist the XML implementation process, data must be ma...
Danico Lee, Costas Tsatsoulis
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 2 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
« Prev « First page 1307 / 1403 Last » Next »