Sciweavers

1805 search results - page 176 / 361
» Functional programming with structured graphs
Sort
View
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 1 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
15 years 7 months ago
Sensor-based Planning for Planar Multi-Convex Rigid Bodies
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
Ji Yeong Lee, Howie Choset
SIGLEX
1991
15 years 4 months ago
Logical Structures in the Lexicon
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
John F. Sowa
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
15 years 10 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 5 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie