Sciweavers

6575 search results - page 1081 / 1315
» Specializing visualization algorithms
Sort
View
JSAC
2008
79views more  JSAC 2008»
13 years 9 months ago
A content-centric framework for effective data dissemination in opportunistic networks
In this paper, we address the challenges of content transfer in opportunistic networks, and propose techniques to better facilitate data dissemination based on the characteristics ...
Ling-Jyh Chen, Chen-Hung Yu, Cheng-Long Tseng, Hao...
JC
2007
160views more  JC 2007»
13 years 9 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
MANSCI
2007
121views more  MANSCI 2007»
13 years 9 months ago
Yahoo! for Amazon: Sentiment Extraction from Small Talk on the Web
Extracting sentiment from text is a hard semantic problem. We develop a methodology for extracting small investor sentiment from stock message boards. The algorithm comprises diï¬...
Sanjiv R. Das, Mike Y. Chen
CGA
1998
13 years 9 months ago
Composite Lighting Simulations with Lighting Networks
A whole variety of different techniques for simulating global illumination in virtual environments have been developed over recent years. Each technique, including Radiosity, Mont...
Philipp Slusallek, Marc Stamminger, Wolfgang Heidr...
MP
2002
143views more  MP 2002»
13 years 9 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
« Prev « First page 1081 / 1315 Last » Next »