Sciweavers

4903 search results - page 688 / 981
» The Set Covering Machine
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 7 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
ISMB
1993
15 years 7 months ago
Finding Relevant Biomolecular Features
Manymethods for analyzing biological problems are constrained by problemsize. Theability to distinguish betweenrelevant andirrelevant features of a problemmay allowa problemto be ...
Lawrence Hunter, Teri E. Klein
ACL
1990
15 years 7 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng
USENIX
1990
15 years 7 months ago
The Evolution of Dbx
Dbx is the standard source-level debugger on most Unix1 workstations. Over the past six years Dbx has grown from a debugger for interpreted Pascal programs to a debugger for compi...
Mark A. Linton
ECCV
2010
Springer
15 years 7 months ago
Towards Computational Models of Visual Aesthetic Appeal of Consumer Videos
In this paper, we tackle the problem of characterizing the aesthetic appeal of consumer videos and automatically classifying them into high or low aesthetic appeal. First, we condu...