Sciweavers

13052 search results - page 2461 / 2611
» The design of natural interaction
Sort
View
RECOMB
2001
Springer
16 years 6 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
CADE
2007
Springer
16 years 6 months ago
MaLARea: a Metasystem for Automated Reasoning in Large Theories
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
Josef Urban
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 6 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
VLDB
2004
ACM
104views Database» more  VLDB 2004»
16 years 6 months ago
Retrieval effectiveness of an ontology-based model for information selection
Technology in the field of digital media generates huge amounts of nontextual information, audio, video, and images, along with more familiar textual information. The potential for...
Latifur Khan, Dennis McLeod, Eduard H. Hovy
« Prev « First page 2461 / 2611 Last » Next »