Sciweavers

1255 search results - page 206 / 251
» Relationships Among PL,
Sort
View
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 8 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
PERCOM
2009
ACM
14 years 8 months ago
Mobile Ad Hoc Networks: the DHT paradigm
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
Marcello Caleffi
KDD
2002
ACM
175views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining product reputations on the Web
Knowing the reputations of your own and/or competitors' products is important for marketing and customer relationship management. It is, however, very costly to collect and a...
Satoshi Morinaga, Kenji Yamanishi, Kenji Tateishi,...
SIGIR
2009
ACM
14 years 2 months ago
On social networks and collaborative recommendation
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
Ioannis Konstas, Vassilios Stathopoulos, Joemon M....
GLOBECOM
2007
IEEE
14 years 2 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu