Sciweavers

559 search results - page 82 / 112
» Augmented Marked Graphs
Sort
View
WWW
2001
ACM
14 years 10 months ago
Placing search in context: the concept revisited
We describe a new paradigm for performing search in context. In the IntelliZap system we developed, search is initiated from a text query marked by the user in a document she view...
Lev Finkelstein, Evgeniy Gabrilovich, Yossi Matias...
GIS
2006
ACM
14 years 11 months ago
Recognition of island structures for map generalization
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...
Stefan Steiniger, Dirk Burghardt, Robert Weibel
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
14 years 19 hour ago
Formal analysis of timed continuous Petri nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
Marius Kloetzer, Cristian Mahulea, Calin Belta, La...
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
13 years 11 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani