Sciweavers

19866 search results - page 201 / 3974
» Computing all factorizations in ***
Sort
View
FOCS
2005
IEEE
16 years 5 days ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 8 months ago
Topology Search over Biological Databases
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
Lin Guo, Jayavel Shanmugasundaram, Golan Yona
PERCOM
2004
ACM
16 years 6 months ago
Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks
In this paper, we introduce the Virtual Paths Routing (VPR) Protocol for ad hoc wireless networks. VPR provides highly dynamic, correct, and efficient paths creation and maintenan...
Abdulrahman H. Altalhi, Golden G. Richard III
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
16 years 1 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
HT
2009
ACM
16 years 1 months ago
ArsMeteo: artworks and tags floating over the planet art
In this paper we present ArsMeteo◦ , a Web 2.0 portal for collecting and sharing digital (or digitalized) artworks, like videos, pictures, poems and music. The ArsMeteo◦ conte...
Edoardo Acotto, Matteo Baldoni, Cristina Baroglio,...