Sciweavers

1017 search results - page 72 / 204
» Some existence and construction results of polygonal designs
Sort
View
MLQ
2008
63views more  MLQ 2008»
14 years 12 months ago
Generic cuts in models of arithmetic
We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of `indicator' is d...
Richard Kaye
CIKM
2010
Springer
14 years 10 months ago
Index structures for efficiently searching natural language text
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
Pirooz Chubak, Davood Rafiei
AVI
2008
15 years 2 months ago
A mixed-fidelity prototyping tool for mobile devices
In this paper we present a software framework which supports the construction of mixed-fidelity (from sketch-based to software) prototypes for mobile devices. The framework is ava...
Marco de Sá, Luís Carriço, Lu...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 6 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
MODELS
2009
Springer
15 years 6 months ago
Feature-oriented programming with Ruby
Features identify core characteristics of software in order to produce families of programs. Through configuration, different variants of a program can be composed. Our approach...
Sebastian Günther, Sagar Sunkle