Sciweavers

1213 search results - page 124 / 243
» Approximation in quantale-enriched categories
Sort
View
WIDM
2006
ACM
15 years 4 months ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
15 years 4 months ago
Visualization of Logic Analysis of Phylogenetic Profiles (LAPP)
Recently Bowers et al. [1] analyzed triplet logic relationships among 4873 Clusters of Orthologous Groups (COGS) from 67 fully sequenced organisms by calculating how well logic re...
Kay A. Robbins, Li Zhao
ISLPED
2005
ACM
85views Hardware» more  ISLPED 2005»
15 years 4 months ago
A low-power crossroad switch architecture and its core placement for network-on-chip
As the number of cores on a chip increases, power consumed by the communication structures takes significant portion of the overall power-budget. The individual components of the...
Kuei-Chung Chang, Jih-Sheng Shen, Tien-Fu Chen
KCAP
2005
ACM
15 years 4 months ago
Indirect anaphora resolution as semantic path search
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
James Fan, Ken Barker, Bruce W. Porter
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 4 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind