Sciweavers

1053 search results - page 87 / 211
» On k-Path Covers and their applications
Sort
View
CRIWG
2006
13 years 11 months ago
Analyzing the Roles of PDA in Meeting Scenarios
This paper proposes a conceptual model standardizing the meeting information structures underlying several scenarios o PDA use in meetings. The paper characterizes the memory and p...
Gustavo Zurita, Pedro Antunes, Luís Carri&c...
JMLR
2008
117views more  JMLR 2008»
13 years 10 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
JUCS
2008
130views more  JUCS 2008»
13 years 10 months ago
Using PDAs in Meetings: Patterns, Architecture and Components
: This paper addresses the role of Personal Digital Assistants (PDAs) in electronic meetings. Several real-world scenarios of PDA usage in meetings are defined using a pattern lang...
Gustavo Zurita, Pedro Antunes, Nelson Baloian, Lu&...
KER
2007
90views more  KER 2007»
13 years 10 months ago
Ontology-based models in pervasive computing systems
Pervasive computing is by its nature open and extensible, and must integrate the information from a diverse range of sources. This leads to a problem of information exchange, so s...
Juan Ye, Lorcan Coyle, Simon Dobson, Paddy Nixon
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 9 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen