Sciweavers

2031 search results - page 345 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SIGITE
2004
ACM
14 years 3 months ago
Experiences using tablet PCs in a programming laboratory
This experience report describes lessons learned using first generation tablet PCs to support active learning in an undergraduate computer science laboratory course. We learned th...
Stephen H. Edwards, N. Dwight Barnette
CIKM
2004
Springer
14 years 3 months ago
Scalable sequential pattern mining for biological sequences
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
Ke Wang, Yabo Xu, Jeffrey Xu Yu
CIKM
2004
Springer
14 years 3 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ECCV
2004
Springer
14 years 3 months ago
A New Robust Technique for Stabilizing Brightness Fluctuations in Image Sequences
Abstract. Temporal random variation of luminance in images can manifest in film and video due to a wide variety of sources. Typical in archived films, it also affects scenes rec...
François Pitié, Rozenn Dahyot, Franc...
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 3 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking