Sciweavers

268 search results - page 38 / 54
» Cleaning Interval Graphs
Sort
View
ALGOSENSORS
2009
Springer
15 years 1 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
CORR
2000
Springer
104views Education» more  CORR 2000»
14 years 10 months ago
ATLAS: A flexible and extensible architecture for linguistic annotation
We describe a formal model for annotating linguistic artifacts, from which we derive an application programming interface (API) to a tools for manipulating these annotations. The ...
Steven Bird, David Day, John S. Garofolo, John Hen...
GIS
2007
ACM
15 years 2 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
TCS
2008
14 years 10 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
CGF
2010
121views more  CGF 2010»
14 years 10 months ago
GraphDice: A System for Exploring Multivariate Social Networks
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
Anastasia Bezerianos, Fanny Chevalier, Pierre Drag...