Sciweavers

1091 search results - page 144 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
CBMS
2006
IEEE
14 years 2 months ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
ICML
2009
IEEE
14 years 2 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
BMCBI
2010
104views more  BMCBI 2010»
13 years 8 months ago
FragViz: visualization of fragmented networks
Background: Researchers in systems biology use network visualization to summarize the results of their analysis. Such networks often include unconnected components, which popular ...
Miha Stajdohar, Minca Mramor, Blaz Zupan, Janez De...
FOCS
2009
IEEE
14 years 2 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 6 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...