Sciweavers

779 search results - page 140 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
INFOCOM
2003
IEEE
14 years 20 days ago
Network Layer Support for Service Discovery in Mobile Ad Hoc Networks
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
Ulas C. Kozat, Leandros Tassiulas
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 7 months ago
BioScout: a life-science query monitoring system
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
RECOMB
2005
Springer
14 years 7 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...