Sciweavers

690 search results - page 106 / 138
» Multi-Agent Only Knowing
Sort
View
JCT
2007
111views more  JCT 2007»
13 years 8 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
EXPERT
2002
146views more  EXPERT 2002»
13 years 8 months ago
The Frame-Based Module of the SUISEKI Information Extraction System
names in the same abstract already indicates a relation between them. Because of its simplicity, we can apply this approach to large amounts of text and establish interaction netwo...
Christian Blaschke, Alfonso Valencia
PR
2007
126views more  PR 2007»
13 years 8 months ago
Convex hull based skew estimation
Skew estimation and page segmentation are the two closely related processing stages for document image analysis. Skew estimation needs proper page segmentation, especially for doc...
Bo Yuan, Chew Lim Tan
CORR
2008
Springer
161views Education» more  CORR 2008»
13 years 7 months ago
Compressed Sensing of Analog Signals
Abstract--A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on ...
Yonina C. Eldar
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 7 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg