Sciweavers

1757 search results - page 21 / 352
» Alternating Refinement Relations
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 10 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
WWW
2004
ACM
14 years 10 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
ICSR
2009
Springer
13 years 7 months ago
Reusing Patterns through Design Refinement
Abstract. Refinement concepts, such as procedural and data refinement, are among the most important ideas of software engineering. In this paper, we investigate the idea of design ...
Jason O. Hallstrom, Neelam Soundarajan
DCG
2010
107views more  DCG 2010»
13 years 4 months ago
An Optimization Problem Related to Minkowski's Successive Minima
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
Romanos Malikiosis
BMCBI
2010
125views more  BMCBI 2010»
13 years 10 months ago
NeatMap - non-clustering heat map alternatives in R
Background: The clustered heat map is the most popular means of visualizing genomic data. It compactly displays a large amount of data in an intuitive format that facilitates the ...
Satwik Rajaram, Yoshi Oono