Sciweavers

874 search results - page 152 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
DASFAA
2005
IEEE
166views Database» more  DASFAA 2005»
14 years 2 months ago
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
Chuan Li, Changjie Tang, Jing Peng, Jianjun Hu, Yo...
DNIS
2005
Springer
102views Database» more  DNIS 2005»
14 years 2 months ago
An Improved Approach to Extract Document Summaries Based on Popularity
With the rapid growth of the Internet, most of the textual data in the form of newspapers, magazines and journals tend to be available on-line. Summarizing these texts can aid the...
P. Arun Kumar, K. Praveen Kumar, T. Someswara Rao,...
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
14 years 2 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
14 years 1 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
ICRA
2010
IEEE
116views Robotics» more  ICRA 2010»
13 years 7 months ago
Learning visibility of landmarks for vision-based localization
— We aim to perform robust and fast vision-based localization using a pre-existing large map of the scene. A key step in localization is associating the features extracted from t...
Pablo Fernández Alcantarilla, Sang Min Oh, ...