Sciweavers

5864 search results - page 1042 / 1173
» Can We Work around Numerical Methods
Sort
View
IS
2008
15 years 7 months ago
A framework for semantic grouping in P2P databases
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...
COMCOM
2007
89views more  COMCOM 2007»
15 years 7 months ago
On-the-fly TCP path selection algorithm in access link load balancing
—Many enterprises install multiple access links for fault tolerance or bandwidth enlargement. Dispatching connections through good links is the ultimate goal in utilizing multipl...
Ying-Dar Lin, Shih-Chiang Tsao, Un-Pio Leong
182
Voted
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 7 months ago
Network Coding over a Noisy Relay : a Belief Propagation Approach
Abstract— In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes...
Sichao Yang, Ralf Koetter
177
Voted
JUCS
2008
185views more  JUCS 2008»
15 years 7 months ago
Recognising Informative Web Page Blocks Using Visual Segmentation for Efficient Information Extraction
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
Jinbeom Kang, Joongmin Choi
173
Voted
JSYML
2006
91views more  JSYML 2006»
15 years 7 months ago
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
Leszek Aleksander Kolodziejczyk
« Prev « First page 1042 / 1173 Last » Next »