Sciweavers

1940 search results - page 270 / 388
» Optimizing search engines using clickthrough data
Sort
View
IPPS
2002
IEEE
14 years 3 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
WEBI
2005
Springer
14 years 3 months ago
Improving Web Clustering by Cluster Selection
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
Daniel Crabtree, Xiaoying Gao, Peter Andreae
NIPS
2008
13 years 11 months ago
Unsupervised Learning of Visual Sense Models for Polysemous Words
Polysemy is a problem for methods that exploit image search engines to build object category models. Existing unsupervised approaches do not take word sense into consideration. We...
Kate Saenko, Trevor Darrell
FEDCSIS
2011
87views more  FEDCSIS 2011»
12 years 9 months ago
Enhanced CakES representing Safety Analysis results of Embedded Systems
—Nowadays, embedded systems are widely used. It is extremely difficult to analyze safety issues in embedded systems, to relate the safety analysis results to the actual parts, a...
Yasmin I. Al-Zokari, Daniel Schneider, Dirk Zeckze...
CODES
2006
IEEE
14 years 4 months ago
Fuzzy decision making in embedded system design
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
Alessandro G. Di Nuovo, Maurizio Palesi, Davide Pa...