Sciweavers

320 search results - page 3 / 64
» Completing design in use: closing the appropriation cycle
Sort
View
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 8 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
SIGIR
2009
ACM
14 years 1 months ago
Evaluating web search using task completion time
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
Ya Xu, David Mease
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
ICFP
2009
ACM
14 years 8 months ago
Scribble: closing the book on ad hoc documentation tools
Scribble is a system for writing library documentation, user guides, and tutorials. It builds on PLT Scheme's technology for language extension, and at its heart is a new app...
Matthew Flatt, Eli Barzilay, Robert Bruce Findler
WCNC
2008
IEEE
14 years 1 months ago
Unequal Error Protection Irregular Over-Complete Mapping for Wavelet Coded Wireless Video Telephony Using Iterative Source and C
— Since the different bits of the compressed video sequence produced by the BBC’s wavelet-based video codec exhibit different error sensitivity, efficient Unequal Error Protec...
Anh Quang Pham, Lie-Liang Yang, Lajos Hanzo