Sciweavers

226 search results - page 3 / 46
» Counting Models using Extension Rules
Sort
View
ICRA
2007
IEEE
150views Robotics» more  ICRA 2007»
14 years 1 months ago
Enhancing Software Modularity and Extensibility: A Case for using Generic Data Representations
— Portable, modular and extensible software allows robotics researchers to pool their resources by sharing algorithms, thus advancing research in the field of robotics at a fast...
Gregory Broten
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 3 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
EMNLP
2009
13 years 5 months ago
A Simple Unsupervised Learner for POS Disambiguation Rules Given Only a Minimal Lexicon
We propose a new model for unsupervised POS tagging based on linguistic distinctions between open and closed-class items. Exploiting notions from current linguistic theory, the sy...
Qiuye Zhao, Mitch Marcus
CIKM
2008
Springer
13 years 9 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
BIRTHDAY
1997
Springer
13 years 11 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler