Sciweavers

272 search results - page 28 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
FOCS
2008
IEEE
14 years 5 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
PLDI
2011
ACM
13 years 1 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
MICCAI
2010
Springer
13 years 9 months ago
Micro-force Sensing in Robot Assisted Membrane Peeling for Vitreoretinal Surgery
Abstract. Vitreoretinal surgeons use 0.5mm diameter instruments to manipulate delicate tissue inside the eye while applying imperceptible forces that can cause damage to the retina...
Marcin Balicki, Ali Uneri, Iulian Iordachita, Jame...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 11 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
14 years 10 days ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu