Sciweavers

10396 search results - page 1589 / 2080
» Testing Web Applications
Sort
View
WWW
2001
ACM
16 years 7 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
CHI
2009
ACM
16 years 7 months ago
Finding canonical behaviors in user protocols
While the collection of behavioral protocols has been common practice in human-computer interaction research for many years, the analysis of large protocol data sets is often extr...
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining templates from search result records of search engines
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
Hongkun Zhao, Weiyi Meng, Clement T. Yu
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
16 years 7 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
« Prev « First page 1589 / 2080 Last » Next »