Sciweavers

10916 search results - page 324 / 2184
» On Constructive Connectives and Systems
Sort
View
DM
2002
104views more  DM 2002»
15 years 6 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
CORR
2011
Springer
172views Education» more  CORR 2011»
15 years 1 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
COLING
2010
15 years 1 months ago
Entity-Focused Sentence Simplification for Relation Extraction
Relations between entities in text have been widely researched in the natural language processing and informationextraction communities. The region connecting a pair of entities (...
Makoto Miwa, Rune Sætre, Yusuke Miyao, Jun-i...
JCT
2011
77views more  JCT 2011»
15 years 1 months ago
Hypercube orientations with only two in-degrees
We consider the problem of orienting the edges of the n-dimensional hypercube so only two different in-degrees a and b occur. We show that this can be done, for two specified in...
Joe Buhler, Steve Butler, Ronald L. Graham, Eric T...
OL
2011
277views Neural Networks» more  OL 2011»
15 years 1 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...