Sciweavers

3819 search results - page 238 / 764
» Simple Easy Terms
Sort
View
POPL
2004
ACM
16 years 7 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
ICC
2007
IEEE
177views Communications» more  ICC 2007»
16 years 1 months ago
An Energy-Aware Protocol for Data Gathering Applications in Wireless Sensor Networks
—Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energ...
Ming Liu, Yuan Zheng, Jiannong Cao, Guihai Chen, L...
ICFCA
2007
Springer
16 years 1 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
HICSS
1998
IEEE
117views Biometrics» more  HICSS 1998»
15 years 11 months ago
OBIWAN - A Visual Interface for Prompted Query Refinement
Typically, users submit very simple search queries to digital document data collections. Often these queries can result in extremely broad answers or answers in which document rel...
James W. Cooper, Roy J. Byrd
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
15 years 10 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara