Sciweavers

1489 search results - page 187 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
BMCBI
2010
164views more  BMCBI 2010»
14 years 10 months ago
Flexible network reconstruction from relational databases with Cytoscape and CytoSQL
Background: Molecular interaction networks can be efficiently studied using network visualization software such as Cytoscape. The relevant nodes, edges and their attributes can be...
Kris Laukens, Jens Hollunder, Thanh Hai Dang, Geer...
WWW
2007
ACM
15 years 10 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...
ICCV
2003
IEEE
15 years 12 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
VRML
2000
ACM
15 years 2 months ago
A spatial hierarchical compression method for 3D streaming animation
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
Toshiki Hijiri, Kazuhiro Nishitani, Tim Cornish, T...