Sciweavers

969 search results - page 144 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
FOCS
1995
IEEE
14 years 8 days ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CP
2000
Springer
14 years 1 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
ECIS
2001
13 years 10 months ago
Critical Information Systems Research: A Habermasian Approach
The paper presents a critical inquiry into the relationship between Computer-Mediated Communication (CMC) and progressive rationalisation in modern organisations. By drawing on th...
Dubravka Cecez-Kecmanovic
AROBOTS
2002
132views more  AROBOTS 2002»
13 years 8 months ago
Feedforward and Feedback Dynamic Trot Gait Control for Quadruped Walking Vehicle
Abstract. To realize dynamically stable walking for a quadruped walking robot, the combination of the trajectory planning of the body and leg position (feedforward control) and the...
Ryo Kurazume, Kan Yoneda, Shigeo Hirose
COLING
2002
13 years 8 months ago
Complexity of Event Structure in IE Scenarios
This paper presents new Information Extraction scenarios which are linguistically and structurally more challenging than the traditional MUC scenarios. Traditional views on event ...
Silja Huttunen, Roman Yangarber, Ralph Grishman