Sciweavers

15375 search results - page 2853 / 3075
» cans 2008
Sort
View
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 6 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
EDBT
2008
ACM
166views Database» more  EDBT 2008»
16 years 6 months ago
OrthoCluster: a new tool for mining synteny blocks and applications in comparative genomics
By comparing genomes among both closely and distally related species, comparative genomics analysis characterizes structures and functions of different genomes in both conserved a...
Xinghuo Zeng, Matthew J. Nesbitt, Jian Pei, Ke Wan...
ICSE
2008
IEEE-ACM
16 years 6 months ago
Proposing SQL statement coverage metrics
An increasing number of cyber attacks are occurring at the application layer when attackers use malicious input. These input validation vulnerabilities can be exploited by (among ...
Ben H. Smith, Yonghee Shin, Laurie Williams
ICFP
2008
ACM
16 years 6 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
ICFP
2008
ACM
16 years 6 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
« Prev « First page 2853 / 3075 Last » Next »