Sciweavers

2877 search results - page 195 / 576
» The Complexity of Planarity Testing
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
15 years 4 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
ICASSP
2010
IEEE
14 years 11 months ago
Robust frequency-based Audio Fingerprinting
Pure frequency-based audio fingerprint systems have the capacity of handling very short fingerprints while being highly robust to perturbations such as additive noise or compressi...
Elsa Dupraz, Gaël Richard
161
Voted
JMLR
2012
13 years 7 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
VIS
2004
IEEE
222views Visualization» more  VIS 2004»
16 years 5 months ago
Non-Linear Model Fitting to Parameterize Diseased Blood Vessels
Accurate estimation of vessel parameters is a prerequisite for automated visualization and analysis of healthy and diseased blood vessels. The objective of this research is to est...
Alexandra La Cruz, Matús Straka, Arnold K&o...
ICRA
2009
IEEE
140views Robotics» more  ICRA 2009»
15 years 11 months ago
1000 Trials: An empirically validated end effector that robustly grasps objects from the floor
—Unstructured, human environments present great challenges and opportunities for robotic manipulation and grasping. Robots that reliably grasp household objects with unknown or u...
Zhe Xu, Travis Deyle, Charles C. Kemp