Sciweavers

1729 search results - page 61 / 346
» Bound Graph Polysemy
Sort
View
AIS
2004
Springer
15 years 10 months ago
Integrated Term Weighting, Visualization, and User Interface Development for Bioinformation Retrieval
This project implements an integrated biological information website that classifies technical documents, learns about users' interests, and offers intuitive interactive visua...
Min Hong, Anis Kairmpour-fard, Steve Russell, Lawr...
ACL
2010
15 years 2 months ago
Wikipedia as Sense Inventory to Improve Diversity in Web Search Results
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
Celina Santamaría, Julio Gonzalo, Javier Ar...
157
Voted
CIE
2007
Springer
15 years 10 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
128
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
135
Voted
SEFM
2008
IEEE
15 years 11 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...