Sciweavers

2490 search results - page 365 / 498
» A General Method for Feature Matching and Model Extraction
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 3 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
IROS
2006
IEEE
121views Robotics» more  IROS 2006»
15 years 9 months ago
Planning and Acting in Uncertain Environments using Probabilistic Inference
— An important problem in robotics is planning and selecting actions for goal-directed behavior in noisy uncertain environments. The problem is typically addressed within the fra...
Deepak Verma, Rajesh P. N. Rao
EMNLP
2010
15 years 1 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
131
Voted
NIPS
2004
15 years 4 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
WWW
2004
ACM
16 years 4 months ago
Using urls and table layout for web classification tasks
We propose new features and algorithms for automating Web-page classification tasks such as content recommendation and ad blocking. We show that the automated classification of We...
L. K. Shih, David R. Karger