Sciweavers

784 search results - page 70 / 157
» Relaxing the Value Restriction
Sort
View
DEXAW
2010
IEEE
166views Database» more  DEXAW 2010»
13 years 10 months ago
Thesaurus Based Term Ranking for Keyword Extraction
In many cases keywords from a restricted set of possible keywords have to be assigned to texts. A common way to find the best keywords is to rank terms occurring in the text accord...
Luit Gazendam, Christian Wartena, Rogier Brussee
DM
2010
66views more  DM 2010»
13 years 9 months ago
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r -1 contains at least r vertex-disjoint directed cycles. Thoma...
Stéphane Bessy, Nicolas Lichiardopol, Jean-...
ADCM
2004
58views more  ADCM 2004»
13 years 9 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...
CONNECTION
2004
92views more  CONNECTION 2004»
13 years 9 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams
WWW
2008
ACM
14 years 9 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari