Sciweavers

9871 search results - page 395 / 1975
» On the Structure of Low Sets
Sort
View
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
16 years 1 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
183
Voted
VL
2008
IEEE
115views Visual Languages» more  VL 2008»
16 years 1 months ago
Flexible visualization of automatic simulation based on structured graph transformation
Visual modeling languages for discrete behavior modeling allow the modeler to describe how systems develop over time during system runs. Models of these languages are the basis fo...
Enrico Biermann, Claudia Ermel, Jonas Hurrelmann, ...
CSCLP
2007
Springer
16 years 1 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 1 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
ICSE
2007
IEEE-ACM
16 years 1 months ago
Automatic Inference of Structural Changes for Matching across Program Versions
Mapping code elements in one version of a program to corresponding code elements in another version is a fundamental building block for many software engineering tools. Existing t...
Miryung Kim, David Notkin, Dan Grossman