Sciweavers

68 search results - page 3 / 14
» Two New Classes of Hamiltonian Graphs: (Extended Abstract)
Sort
View
CSL
2004
Springer
13 years 7 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
DKE
2006
94views more  DKE 2006»
13 years 7 months ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
14 years 2 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 7 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
CHI
2005
ACM
14 years 8 months ago
Extending tangible interfaces for education: digital montessori-inspired manipulatives
This paper introduces a new framework for thinking about tangible interfaces in education, with specific focus on problem domains. Manipulatives are physical objects specifically ...
Oren Zuckerman, Saeed Arida, Mitchel Resnick