Sciweavers

4037 search results - page 81 / 808
» Routing without ordering
Sort
View
ACL
1997
13 years 10 months ago
Retrieving Collocations by Co-occurrences and Word Order Constraints
In this paper, we describe a method for automatically retrieving collocations from large text corpora. This method retrieve collocations in the following stages: 1) extracting str...
Sayori Shimohata, Toshiyuki Sugio, Junji Nagata
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 2 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
TPHOL
1997
IEEE
14 years 1 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
LICS
1995
IEEE
14 years 18 days ago
Decision Problems for Second-Order Linear Logic
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
Patrick Lincoln, Andre Scedrov, Natarajan Shankar
EJASP
2010
142views more  EJASP 2010»
13 years 3 months ago
Linear High-Order Distributed Average Consensus Algorithm in Wireless Sensor Networks
This paper presents a linear high-order distributed average consensus (DAC) algorithm for wireless sensor networks. The average consensus property and convergence rate of the high...
Gang Xiong, Shalinee Kishore