Sciweavers

2168 search results - page 45 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
COMPSAC
2008
IEEE
14 years 3 months ago
Error Modeling in Dependable Component-Based Systems
Component-Based Development (CBD) of software, with its successes in enterprise computing, has the promise of being a good development model due to its cost effectiveness and pote...
Hüseyin Aysan, Sasikumar Punnekkat, Radu Dobr...
ACL
2006
13 years 10 months ago
An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
Vijay Krishnan, Christopher D. Manning
IPPS
2008
IEEE
14 years 3 months ago
Efficient and dependable overlay networks
We describe QoSMap, a novel approach for mapping overlay networks with stringent QoS requirements. QoSMap computes high quality overlay paths by utilizing direct underlay paths th...
Jawwad Shamsi, Monica Brockmeyer
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 3 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
CIKM
2009
Springer
14 years 3 months ago
Post-rank reordering: resolving preference misalignments between search engines and end users
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
Chao Liu, Mei Li, Yi-Min Wang