Sciweavers

943 search results - page 5 / 189
» How should data structures and algorithms be taught
Sort
View
VLDB
2007
ACM
144views Database» more  VLDB 2007»
15 years 3 months ago
A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Je...
SIGCSE
1999
ACM
93views Education» more  SIGCSE 1999»
15 years 1 months ago
Patterns for decoupling data structures and algorithms
In order to build a data structure that is extensible and reusable, it is necessary to decouple the intrinsic and primitive behavior of the structure from the application specific...
Dung Zung Nguyen, Stephen B. Wong
AIEDU
2010
14 years 7 months ago
Supporting Collaborative Learning and E-Discussions Using Artificial Intelligence Techniques
An emerging trend in classrooms is the use of networked visual argumentation tools that allow students to discuss, debate, and argue with one another in a synchronous fashion about...
Bruce M. McLaren, Oliver Scheuer, Jan Miksatko
VCIP
2003
170views Communications» more  VCIP 2003»
14 years 11 months ago
How good are the visual MPEG-7 features?
The study presented in this paper analyses descriptions extracted with MPEG-7-descriptors from visual content from the statistical point of view. Good descriptors should generate ...
Horst Eidenberger
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...