Sciweavers

9997 search results - page 441 / 2000
» The case for crowd computing
Sort
View
FOCS
2005
IEEE
16 years 14 days ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan
HICSS
2005
IEEE
82views Biometrics» more  HICSS 2005»
16 years 14 days ago
To the Question "Does IT Matter?" Hollywood Answers "Yes"
Nicholas Carr’s question “Does IT Matter?”(to the maintenance of competitive advantage) has been applied to many industries but the one that depends on IT almost exclusively...
David A. Cook, Wenli Wang
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
16 years 14 days ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao
ICCSA
2005
Springer
16 years 11 days ago
Detecting Water Area During Flood Event from SAR Image
Abstract. In this paper, efficient and economical methods for water area detection during flood event in mountainous area is proposed. To accomplish this, various case studies were...
Hong-Gyoo Sohn, Yeong-Sun Song, Gi-Hong Kim
WG
2005
Springer
16 years 10 days ago
Approximation Algorithms for the Weighted Independent Set Problem
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...