Sciweavers

2783 search results - page 321 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
97
Voted
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
15 years 8 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
109
Voted
ACSC
2006
IEEE
15 years 8 months ago
A semantic approach to boost passage retrieval effectiveness for question answering
In the current state of the rapid growth of information resources and the huge number of requests submitted by users to existing information retrieval systems; recently, Question ...
Bahadorreza Ofoghi, John Yearwood, Ranadhir Ghosh
136
Voted
AXMEDIS
2006
IEEE
215views Multimedia» more  AXMEDIS 2006»
15 years 8 months ago
Distributed Architectures for High Performance and Privacy-Aware Content Generation and Delivery
The increasing heterogeneity of mobile client devices used to access the Web requires run-time adaptations of the Web contents. A significant trend in these content adaptation se...
Claudia Canali, Michele Colajanni, Riccardo Lancel...
DEXAW
2006
IEEE
179views Database» more  DEXAW 2006»
15 years 8 months ago
Opportunistic Networks: Challenges in Specializing the P2P Paradigm
We introduce the notion of opportunistic networks or oppnets, some of which can be considered a subclass of the peer-to-peer (P2P) networks. Initially, a relatively small seed opp...
Leszek Lilien, Zille Huma Kamal, Ajay K. Gupta
APLAS
2005
ACM
15 years 7 months ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...